Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Regular graph")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1138

  • Page / 46
Export

Selection :

  • and

The face pair of planar graphsYANG YUANSHENG; LIN XIAOHUI; QIAO JING et al.Discrete mathematics. 2006, Vol 306, Num 15, pp 1742-1757, issn 0012-365X, 16 p.Article

Eigenvalues and edge-connectivity of regular graphsCIOABA, Sebastian M.Linear algebra and its applications. 2010, Vol 432, Num 1, pp 458-470, issn 0024-3795, 13 p.Article

On strongly regular graphs with μ≤2BAGCHI, Bhaskar.Discrete mathematics. 2006, Vol 306, Num 14, pp 1502-1504, issn 0012-365X, 3 p.Conference Paper

Crossing regular drawings of graphsHARBORTH, H; MENGERSEN, I.Zeitschrift für angewandte Mathematik und Mechanik. 1996, Vol 76, pp 51-54, issn 0044-2267, SUP3Conference Paper

An inequality involving the second largest and smallest eigenvalue of a distance-regular graphKOOLEN, Jack H; PARK, Jongyook; YU, Hyonju et al.Linear algebra and its applications. 2011, Vol 434, Num 12, pp 2404-2412, issn 0024-3795, 9 p.Article

A class of amply regular graphs related to the subconstituents of a dual polar graphLI, Feng-Gao; WANG, Yang-Xian.Discrete mathematics. 2006, Vol 306, Num 22, pp 2909-2915, issn 0012-365X, 7 p.Article

Regular Kn-free graphsBAUER, D.Journal of combinatorial theory. Series B. 1983, Vol 35, Num 2, pp 193-200, issn 0095-8956Article

Factorizations of regular graphs of high degreeHILTON, A. J. W.Journal of graph theory. 1986, Vol 9, Num 1, pp 193-196, issn 0364-9024Article

Regular graphs of high degree are 1-factorizableCHETWYND, A. G; HILTON, A. J. W.Proceedings of the London Mathematical Society. 1985, Vol 50, Num 2, pp 193-206, issn 0024-6115Article

Some new two-weight codes and strongly regular graphsBROUWER, A. E.Discrete applied mathematics. 1985, Vol 10, Num 1, pp 111-114, issn 0166-218XArticle

Characterization of a class of distance regular graphsNEUMAIER, A.Journal für die reine und angewandte Mathematik. 1985, Vol 357, pp 182-192, issn 0075-4102Article

The linear arboricity of some regular graphsENOMOTO, H; PEROCHE, B.Journal of graph theory. 1984, Vol 8, Num 2, pp 309-324, issn 0364-9024Article

Every 4-regular graph plus an edge contains a 3-regular subgraphALON, N; FRIEDLAND, S; KALAI, G et al.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 1, pp 92-93, issn 0095-8956Article

On a problem of A. Kotzig concerning factorizations of 4-regular graphsZELINKA, B.Journal of graph theory. 1984, Vol 8, Num 2, pp 325-330, issn 0364-9024Article

On smallest regular graphs with a given isopartFINK, J. F.Journal of graph theory. 1985, Vol 9, Num 1, pp 105-117, issn 0364-9024Article

The uniqueness of the strongly regular graph on 77 pointsBROUWER, A. E.Journal of graph theory. 1983, Vol 7, Num 4, pp 455-461, issn 0364-9024Article

Maximum Matching in Regular and Almost Regular GraphsYUSTER, Raphael.Algorithmica. 2013, Vol 66, Num 1, pp 87-92, issn 0178-4617, 6 p.Article

Strongly regular graphs with non-trivial automorphismsBEHBAHANI, Majid; LAM, Clement.Discrete mathematics. 2011, Vol 311, Num 2-3, pp 132-144, issn 0012-365X, 13 p.Article

The clique numbers of regular graphs of matrix algebras are finiteAKBARI, S; JAMAALI, M; SEYED FAKHARI, S. A et al.Linear algebra and its applications. 2009, Vol 431, Num 10, pp 1715-1718, issn 0024-3795, 4 p.Article

Edge-colouring of joins of regular graphs, IDE SIMONE, Caterina; GALLUCCIO, Anna.Journal of combinatorial optimization. 2009, Vol 18, Num 4, pp 417-428, issn 1382-6905, 12 p.Conference Paper

Non-separating 2-factors of an even-regular graphHIGUCHI, Yusuke; NOMURA, Yuji.Discrete mathematics. 2008, Vol 308, Num 23, pp 5538-5547, issn 0012-365X, 10 p.Article

A note on a conjecture on maximum matching in almost regular graphsPICOULEAU, C.Discrete mathematics. 2010, Vol 310, Num 24, pp 3646-3647, issn 0012-365X, 2 p.Article

Designs on the webBAILEY, R. A; CAMERON, Peter J; DOBCSANYI, Peter et al.Discrete mathematics. 2006, Vol 306, Num 23, pp 3014-3027, issn 0012-365X, 14 p.Conference Paper

Efficient testing of hypergraphs: (Extended abstract)KOHAYAKAWA, Yoshiharu; NAGLE, Brendan; RÖDL, Vojtech et al.Lecture notes in computer science. 2002, pp 1017-1028, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

Factors in a class of regular digraphsRAMANATH, M. V. S.Journal of graph theory. 1985, Vol 9, Num 1, pp 161-175, issn 0364-9024Article

  • Page / 46